Strengthening Lagrangian Bounds for theMAX - SAT Problem
نویسندگان
چکیده
We propose an algorithm for the strengthening of the Generalized Set Covering formulation of the MAX-SAT Problem. Unlike the standard approach, our procedure does not rely on the solution of the linear relaxation to generate the cuts used to strengthen the formulation. On the contrary, it computes a La-grangian bound and uses the Lagrangian multipliers to guide the generation of cutting planes. Some of the cuts generated by the separation procedure have the additional feature that, once added to the original formulation, cause a strict increase of the lower bound.
منابع مشابه
Strengthening Lagrangian Bounds for theMAX - SAT Problem ( Extended
We propose an algorithm for the strengthening of the Generalized Set Covering formulation of the MAX-SAT Problem. Unlike the standard approach, our procedure does not rely on the solution of the linear relaxation to generate the cuts used to strengthen the formulation. On the contrary, it computes a La-grangian bound and uses the Lagrangian multipliers to guide the generation of cutting planes....
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملDynamic SAT with Decision Change Costs: Formalization and Solutions
We address a dynamic decision problem in which decision makers must pay some costs when they change their decisions along the way. We formalize this problem as Dynamic SAT (DynSAT) with decision change costs, whose goal is to find a sequence of models that minimize the aggregation of the costs for changing variables. We provide two solutions to solve a specific case of this problem. The first u...
متن کاملمساله پوشش هاب تک تخصیصی بر روی شبکه ستارهای؛ مدلبندی، خطیسازی و یافتن کران مناسب برای آن
The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...
متن کاملWorst-Case Upper Bounds
There are many algorithms for testing satisfiability — how to evaluate and compare them? It is common (but still disputable) to identify the efficiency of an algorithm with its worst-case complexity. From this point of view, asymptotic upper bounds on the worst-case running time and space is a criterion for evaluation and comparison of algorithms. In this chapter we survey ideas and techniques ...
متن کامل